Performance Evaluation of Vector Evaluated Gravitational Search Algorithms Based on ZDT Test Functions
نویسندگان
چکیده
This paper presents a performance evaluation of Vector Evaluated Gravitational Search Algorithm (VEGSA), namely VEGSA-I and VEGSA-II algorithms, for multi-objective optimization problems. The VEGSA algorithms use a number of populations of particles. In particular, a population of particles corresponds to one objective function to be minimized or maximized. Simultaneous minimization or maximization of every objective function is realized by exchanging a variable between populations. Performance evaluation is done based on ZDT test functions, which is a common benchmark problem for multiobjective optimization. The results shows that both VEGSA algorithms are outperformed by other multi-objective optimization algorithms and further enhancements are needed before it can be employed in any application. Keywords-gravitational search algorithm; multi-objective optimization problem;
منابع مشابه
A Hybrid MOEA/D-TS for Solving Multi-Objective Problems
In many real-world applications, various optimization problems with conflicting objectives are very common. In this paper we employ Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D), a newly developed method, beside Tabu Search (TS) accompaniment to achieve a new manner for solving multi-objective optimization problems (MOPs) with two or three conflicting objectives. This i...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملFUZZY GRAVITATIONAL SEARCH ALGORITHM AN APPROACH FOR DATA MINING
The concept of intelligently controlling the search process of gravitational search algorithm (GSA) is introduced to develop a novel data mining technique. The proposed method is called fuzzy GSA miner (FGSA-miner). At first a fuzzy controller is designed for adaptively controlling the gravitational coefficient and the number of effective objects, as two important parameters which play major ro...
متن کاملآموزش شبکه عصبی MLP در فشردهسازی تصاویر با استفاده از روش GSA
Image compression is one of the important research fields in image processing. Up to now, different methods are presented for image compression. Neural network is one of these methods that has represented its good performance in many applications. The usual method in training of neural networks is error back propagation method that its drawbacks are late convergence and stopping in points of lo...
متن کامل